Aid in Joint Set Identiication

نویسندگان

  • David PEEL
  • William J. WHITEN
چکیده

When examining a rock mass, joint sets and their orientations can play a signiicant role with regard to how the rock mass will behave. To identify joint sets present in the rock mass, measurements of the orientation of individual fractures can be measured on exposed rock faces and the resulting data examined for heterogeneity. In this paper, the EM algorithm is utilized to t mixtures of Kent component distributions to the fracture data to aid in the identiication of joint sets. An extra uniform component is also included in the model to accommodate the noise present in the data.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Data - Recursive Algorithms for Blind Channel Identi cation inDirect - Sequence

Algorithms for performing blind channel identiication for a binary phase-shift keyed (BPSK) direct-sequence spread-spectrum (DS/SS) system operating over a fading channel are presented. These algorithms are derived by identifying the DS/SS system as a discrete oversampled system with intersymbol interference. In this setting the spreading code can be viewed as a transmit lter, the knowledge of ...

متن کامل

Blind identification of a linear-quadratic mixture of independent components based on joint diagonalization procedure

In this paper, we address the problem of the blind identii-cation of linear-quadratic instantaneous mixture of statistically independent random variables. This problem consists in the identiication of an unknown linear-quadratic transmission channel excited by temporally correlated and mutually independent source signals, using only statistical information on the observations received by an arr...

متن کامل

Subspace algorithms for system identi cation andstochastic realization

The subspace approach for linear realization and identiication problems is a promising alternative for the 'classical' identiication methods. It has advantages with respect to structure determination and parametrization of linear models, is computationally simple and numerically robust. A summary is given of existing techniques based upon the singular value and qr decomposition. Algebraic, geom...

متن کامل

On Convergence Proofs in System Identi cation { A General Principle using ideas from Learning Theory

It is shown that learning theory ooers convergence analysis tools that are useful in system identiication problems. They allow analysis in a parameter-free context, which elevates the analysis from parameter sets to model sets and from parameter identiication to model identiication. When a paramterization is eventually introduced, this leads to alternative assumptions on the parameterization an...

متن کامل

Coscheduling Based on Run-Time Identi cation of Activity Working Sets

This paper introduces a method for runtime identiication of sets of interacting activities (\working sets") with the purpose of coscheduling them, i.e. scheduling them so that all the activities in the set execute simultaneously on distinct processors. The identiication is done by monitoring access rates to shared communication objects: activities that access the same objects at a high rate the...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2000